Novel Pseudorandom Number Generator Scheme Employing 3-Dimensional Cellular Automata

This research proposes a novel three dimensional cellular automata (3-D CA) scheme for pseudo random number generation which is highly secure than the two dimensional cellular automata (2-D CA). It removes security and boundary problems with the 2-D CA. The use of 1-D CA was very common in late 80s which was then improved with 2-D CA. Research literature shows that 2-D CA is suffering from security and boundary problems. The proposed scheme is implemented using C++ to test its performance against others similar systems using DIHARD and ENT standard test suites. Simulations are performed on 200 sets for both DIHARD and ENT. Simulation results show that the proposed scheme performs better than that of the older version especially in terms of security and boundary. In DIEHARD and ENT test the proposed scheme produces better success rate than older versions.